A normal screenable nonparacompact space in ZFC
نویسندگان
چکیده
منابع مشابه
A Screenable, Σ-relatively Discrete Dowker Space
A Dowker space (that is, a normal space that is not countably metacompact) is constructed which is also screenable and the countable union of discrete subspaces. The construction and proofs are easy modifications of the ones for Balogh’s screenable Dowker space [B1]. Balogh’s example is presented alongside the modification in a new exposition with several new results common to the two spaces, i...
متن کاملCombinatorics in Zfc Limbo
In their paper, Large-scale regularities of lattice embeddings of posets [RW99], Remmel and Williamson studied extremal properties of posets and their incomparability graphs on N k . Properties (1) through (3) of their main result, Theorem 1.5, are proved using Ramsey theory. The proof of Theorem 1.5 (4), however, uses Friedman’s Jump Free Theorem ([Fri97] and [Fri98] ), a powerful ZFC independ...
متن کاملA Brief Introduction to Zfc
We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular at students of mathematics who are familiar with set theory from a “naive” perspective, and are interested in the underlying axiomatic development. We will quickly review some basic concepts of set theory, before focusing on the set theoretic definition...
متن کاملTopology in Zfc*
The first-order theory of linear order is far from trivia!. The monadic (secondorder) theory of linear order is much stronger. Stil~ surpr,Mng decidability results were proven in that direction. Rabin proved in [10i that the monadic theory of the rational chain is decidable. Hence the monadic theory of all countable linear orders is decidable. Biichi proved in [I] that the monadic theory of ord...
متن کاملIncompleteness in Zfc
The statements of Gödel's incompleteness theorems are famous in mathematics, concerning the foundations of the eld. Whilst most mathematicians have heard of the theorems, few outside of mathematical logic would have gone through the technically sophisticated proofs. Instead of proving the original theorem for the theory of natural numbers and utilizing the notion of consistency, we prove a vers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1998
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-98-04425-6